Classroom note: Some partitions of S(2, 3, v2) and S(2, 4, 2)

نویسنده

  • Marialuisa J. de Resmini
چکیده

Introduction The aim of this note is to provide a Steiner triple system STS( v ) which admits a partition into v STS( v) for every v 1 or 3 (mod 6). The STS( v ) obtained in this way will also contain ~v( v 1) subsystems of order 3v. An analogous construction is provided of an S(2, 4, v ) with a partition into v S(2, 4, v)'s in the case v 1 (mod 12). The Steiner system constructed here will also contain f2v(v 1) subsystems of order 4v. We observe that the direct product construction of an S(2, 3, v 2 ), an S(2, 4, v 2 ), respectively, provides Steiner systems with a completely different structure. We assume the reader is familiar with the Steiner system terminology and refer to [1, 7) for background and to [5, 6J for more literature on the subject. The constructions 1. S(2, 3, v 2 ) Take any v pairwise disjoint STS(v)'s on the points Aj,Bj, ... ,Zj, j = 1,2 ... v. Their blocks will be blocks of the STS( v 2 ) S we want to construct. Each of the remaining ~V2V( v 1) blocks consists of three points in distinct STS( v )'s. To decide how to form triples of subsystems, we take any ST S( v), Li, on the "points" A, B, . .. , Z. For any block, ABC say, of Li we use Construction 1 in [3], i.e. we construct an STS(3v) having A,B, and C as subsystems. Thus the v 2 blocks coming from the triple ABC are obtained from the v base blocks [3]:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

k-Efficient partitions of graphs

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

متن کامل

Common transversals for partitions of a finite set

For s 2, t 1, let A1; : : : ;At be s-cell partitions of a finite set X . Assume that if x;y 2 X , x 6= y, then x;y belong to different cells of at least one of the partitions Ai. For each k 1, let c(s; t;k) be the least integer such that if A1; : : : ;At , X satisfy the preceding conditions, and the smallest of all the cells of all the partitions has exactly k elements, and jX j c(s; t;k), then...

متن کامل

The complexity of Euler's integer partition theorem

Euler’s integer partition theorem stating that the number of partitions of an integer into odd integers is equal to the number of partitions into distinct integers ranks 16 in Wells’ list of the most beautiful theorems [17]. In this paper we use the algorithmic method to evaluate the complexity of mathematical statements developed in [3, 4, 5] to show that Euler’s theorem is in class CU,7, the ...

متن کامل

ar X iv : m at h / 01 10 18 5 v 1 [ m at h . C O ] 1 7 O ct 2 00 1 S – Partitions

This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2 − 1 for some integer k. Such partitions have potential applications in cryptography, specifically in distributed computations of the form a mod m. The main contribution of this paper is a correction to the upper-bound on number of s-partitions presented by Bhatt [1]. We will gi...

متن کامل

Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s

A vector space partition of a finite vector space V over the field of q elements is a collection of subspaces whose union is all of V and whose pairwise intersections are trivial. While a number of necessary conditions have been proved for certain types of vector space partitions to exist, the problem of the existence of partitions meeting these conditions is still open. In this note, we consid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 10  شماره 

صفحات  -

تاریخ انتشار 1994